Optimal base point selection method based on convex hull construction technology
نویسندگان
چکیده
The primary purpose of maritime delimitation is to ensure the maximum internal waters area obtained. In order grantee obtained with selected base point, idea and method optimal selection territorial sea points convex hull (minimum hull) construction technology proposed. ideal are by constructing for all alternative points, which makes it possible realize automatic under principle area.
منابع مشابه
Mobile robot navigation based on optimal via-point selection method
In this paper, a new navigation algorithm for wheeled mobile robots is proposed The proposed algorithm utilizes fmzy multi-attribute decision making method in deciding which via-point the robot would proceed at each decision step. Via-point is defined as the local target point of robot’s movement at each decision instance. We define a few fwzy goals to achieve successful robot navigation. At ea...
متن کاملA Rank-based Convex Hull method for Dense Data Sets
A novel 2-D method for computing the convex hull of a sufficiently dense set of n integer points is introduced. The approach employs a ranking function that avoids sorting the points directly thus reducing the overall time complexity. The ranked points create a simple polygonal chain from which the Convex Hull can be found using a suitable O(n) method. The result is achieved by placing a bound ...
متن کاملConvex hull based skew estimation
Skew estimation and page segmentation are the two closely related processing stages for document image analysis. Skew estimation needs proper page segmentation, especially for document images with multiple skews that are common in scanned images from thick bound publications in 2-up style or postal envelopes with various printed labels. Even if only a single skew is concerned for a document ima...
متن کاملMinimizing within Convex Bodies Using a Convex Hull Method
We present numerical methods to solve optimization problems on the space of convex functions or among convex bodies. Hence convexity is a constraint on the admissible objects, whereas the functionals are not required to be convex. To deal with, our method mix geometrical and numerical algorithms. We give several applications arising from classical problems in geometry and analysis: Alexandrov’s...
متن کاملOn Sumsets and Convex Hull
One classical result of Freiman gives the optimal lower bound for the cardinality of A + A if A is a d-dimensional finite set in R. Matolcsi and Ruzsa have recently generalized this lower bound to |A+ kB| if B is d-dimensional, and A is contained in the convex hull of B. We characterize the equality case of the Matolcsi–Ruzsa bound. The argument is based partially on understanding triangulation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S web of conferences
سال: 2021
ISSN: ['2555-0403', '2267-1242']
DOI: https://doi.org/10.1051/e3sconf/202124502034